A new method for queuing performance estimates Using Markov chains
نویسنده
چکیده
• The system has two states, on and off. In an off state, no work will arrive. • If the system is in an off state then, with probability f0, in the next time unit the system is also an off state. • If the system is in an off state then with probability fi in the next time unit the system will move to an on state which will last for exactly i time units then move to an off state. • If the system is on then a non-zero integer number of work units will arrive in this time period. The number of units of work which arrive is an i.i.d.
منابع مشابه
A New Algorithm for Performance Evaluation of Homogeneous Architectural Styles
Software architecture is considered one of the most important indices of software engineering today. Software Architecture is a technical description of a system indicating its component structures and their relationships, and is the principles and rules governing designing. The success of the software depends on whether the system can satisfy the quality attributes. One of the most critical as...
متن کاملA New Algorithm for Performance Evaluation of Homogeneous Architectural Styles
Software architecture is considered one of the most important indices of software engineering today. Software Architecture is a technical description of a system indicating its component structures and their relationships, and is the principles and rules governing designing. The success of the software depends on whether the system can satisfy the quality attributes. One of the most critical as...
متن کاملQueuing delay performance of the integrated cellular and ad hoc relaying system
The Integrated Cellular and Ad hoc Relaying (iCAR) system is a representative heterogeneous wireless system, proposed to address the congestion problem in the wireless networks. In this paper, we present an analytic model based on Markov chains for the queuing delay performance of iCAR. Our results show that the new call requests in iCAR have a significantly lower queuing delay than that of the...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملImbedded Markov Chains Model of Multiprocessor with Shared Memory
This paper addresses the problem of evaluating the performance of multiprocessor with shared memory and private caches executing Invalidate Coherence Protocols. The model is grounded in queuing network theory and includes bus interference, cache interference, and main memory interference. The method of the Imbedded Markov Chains is used. The highest and lowest performance characteristics are ca...
متن کامل